拟非扩张映像族的公共不动点的迭代方法

引入了修正的杂交投影迭代算法,用来构造Hilbert空间中拟非扩张映像族的公共不动点.使用新的算法证明了几个强收敛定理.新算法的优点是不要求映像具有次闭性质.     

拓扑向量空间中锥拟凸多目标规划锥有效解集的连通性(英文)

本文研究局部凸的拓扑向量空间中锥拟凸多目标规划锥有效解集的连通性问题.证明了定义在紧凸集上目标映射为一对一的锥拟凸多目标规划的锥有效解集是连通的.在证明中,广义鞍点定理起着关键的作用.     

Banach空间中均衡问题和弱相对非扩展映射的强收敛定理及其应用(英文)

本文在Banach空间中设计了一些新的杂交迭代算法用以逼近一类均衡问题解集和弱相对非扩展映射不动点集或极大单调算子零点集的公共元.得到了一些强收敛的结论,并将它们推广到逼近一类均衡问题解集和有限个弱相对非扩展映射公共不动点集或有限个极大单调算子公共零点集的公共元的情形.最后,展示了本文的迭代算法在最优化问题上的应用.     

不连续随机算子随机不动点定理及其应用

该文利用半序理论和随机压缩映象原理,得到了一类不连续随机增算子随机不动点的唯一存在定理.作为应用,考虑了R~n中含间断项的一阶随机微分积分方程初值问题.     

A new uniform mapping algorithm for sample selection

A new algorithm for sample selection in the field of experimental design is presented. This method was designed for a multivariate data set of samples where the variables' levels are pre‐determined by the system instead of being determined by the practitioner and especially appropriate for non‐symmetrical multivariable space. Symmetrical experimental designs are not applicable in either of the cases. Anyway, this method is also applicable to symmetrical designs. Several tests have been made for symmetrical and non‐symmetrical cases and also about an already treated real case, comparing the new algorithm with others previously known in literature. Its performance has been checked considering several evaluation quality criteria like D‐optimal, A‐optimal, G‐optimal and models error prediction. Copyright © 2008 John Wiley & Sons, Ltd.     

D-η-半预不变真拟凸多目标优化的最优性刻画

首先,举例验证了三种D-η-半预不变真拟凸映射的存在性;然后,在D-η-半严格(严格)半预不变真拟凸性下,得出了多目标优化问题的局部有效解为全局有效解,局部弱有效解为全局弱有效解,并举例验证了所得结果;最后,在D-η-严格半预不变真拟凸性下,建立了多目标优化问题的全局弱有效解和局部弱有效解的唯一性的刻画。     

Convergence of hybrid viscosity and steepest-descent methods for pseudocontractive mappings and nonlinear Hammerstein equations

In this article, we first introduce an iterative method based on the hybrid viscosity approximation method and the hybrid steepest-descent method for finding a fixed point of a Lipschitz pseudocontractive mapping (assuming existence) and prove that our proposed scheme has strong convergence under some mild conditions imposed on algorithm parameters in real Hilbert spaces. Next, we introduce a new iterative method for a solution of a nonlinear integral equation of Hammerstein type and obtain strong convergence in real Hilbert spaces. Our results presented in this article generalize and extend the corresponding results on Lipschitz pseudocontractive mapping and nonlinear integral equation of Hammerstein type reported by some authors recently. We compare our iterative scheme numerically with other iterative scheme for solving non-linear integral equation of Hammerstein type to verify the efficiency and implementation of our new method.     

Designing Network Encryption Machine Based on Henon Chaotic Key Algorithm

Nowadays, embedded network products are widely used in various technological fields. However, when such products are used, the transmission of network data could not be guaranteed with high security. To address the issue, this paper designed a network encryption machine based on S3C6410 processor and DM9000 Ethernet controller. The hardware circuit of this encryption machine is designed and developed with conciseness and stability. In software design, an improved algorithm of chaotic encryption based on Henon mapping is proposed. The algorithm overcomes the shortcoming in combining Logistic and Tent chaotic sequences. Moreover, the paper demonstrates some comparative experiments about autocorrelation and randomness. The results indicate that the new algorithm based on Henon chaotic sequences has a good performance in safety and is able to meet the requirements of confidential communications.     

An open mapping theorem for Young measures

Ditor and Eifler consider the open mapping theorem for the probability spaces. Here we attempt to generalize the theorem to the spaces of Young measures.